Partitioned iterated function systems with division and a fractal dependence graph in recognition of 2D shapes

نویسندگان

  • Krzysztof Gdawiec
  • Diana Domanska
چکیده

One of the approaches in pattern recognition is the use of fractal geometry. The property of self-similarity of fractals has been used as a feature in several pattern recognition methods. All fractal recognition methods use global analysis of the shape. In this paper we present some drawbacks of these methods and propose fractal local analysis using the partitioned iterated function systems with division. Moreover, we introduce a new fractal recognition method based on a dependence graph obtained from the partitioned iterated function system. The proposed method uses the local analysis of the shape, which improves the recognition rate. The effectiveness of our method is shown on two test databases. The first one was created by the authors and the second one is the MPEG7 CE-Shape-1PartB database. The obtained results show that the proposed methodology has led to a significant improvement in the recognition rate.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Boundary Controlled Iterated Function Systems

Boundary Controlled Iterated Function Systems is a new layer of control over traditional (linear) IFS, allowing creation of a wide variety of shapes. In this work, we demonstrate how subdivision schemes may be generated by means of Boundary Controlled Iterated Function Systems, as well as how we may go beyond the traditional subdivision schemes to create free-form fractal shapes. BC-IFS is a po...

متن کامل

Manipulation of Non-Linear IFS attractors using Genetic Programming

Non-linear Iterated Function Systems (IFSs) are very powerful mathematical objects related to fractal theory, that can be used in order to generate (or model) very irregular shapes. We investigate in this paper how Genetic Programming techniques can be efficiently exploited in order to generate randomly or interactively artistic “fractal” 2D shapes. Two applications are presented for different ...

متن کامل

Linear Fractal Shape Interpolation

Interpolation of two-dimensional shapes described by iterated function systems is explored. Iterated function systems define shapes using self-transformations, and interpolation of these shapes requires interpolation of these transformations. Polar decomposition is used to avoid singular intermediate transformations and to better simulate articulated motion. Unlike some other representations, s...

متن کامل

Fractal Image Compression Using Genetic Algorithm with Variants of Crossover

Fractal image compression techniques are developed due to recognition that fractals may describe natural scenes greater than shapes of regular geometry. One of the very efficient fractal methods is based on iterated function system (IFS), and may be developed by Bamsley and Jacquin. New techniques for image compression while using the theory of fractal. The fractal codes are made assuming self ...

متن کامل

Fractal image compression and recurrent iterated function systems

ractal geometry provides a basis for modF eling the infinite detail found in nature. Fractal methods are quite popular in computer graphics for modeling natural phenomena such as mountains, clouds, and many kinds of plants. Linear fractal models such as the iterated function system (IFS), recurrent iterated function system (RIFS), and Lindenmeyer systern (L-system) concisely describe complex ob...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Applied Mathematics and Computer Science

دوره 21  شماره 

صفحات  -

تاریخ انتشار 2011